New Results in Graph Layout∗
نویسندگان
چکیده
A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models of graph layout. In particular, we improve on the results of Enomoto and Miyauchi [SIAM J. Discrete Math., 1999] regarding stack layouts of subdivisions, and give analogous results for queue layouts. We solve open problems due to Felsner, Wismath, and Liotta [Proc. Graph Drawing, 2001] and Pach, Thiele, and Toth [Proc. Graph Drawing, 1997] concerning three-dimensional straight-line grid drawings. We initiate the study of three-dimensional polyline grid drawings and establish volume bounds within a logarithmic factor of optimal.
منابع مشابه
Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems
This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...
متن کاملSoftware Implementation and Experimentation with a New Genetic Algorithm for Layout Design
This paper discusses the development of a new GA for layout design. The GA was already designed and reported. However the implementation used in the earlier work was rudimentary and cumbersome, having no suitable Graphical User Interface, GUI. This paper discusses the intricacies of the algorithm and the GA operators used in previous work. It also reports on implementation of a new GA operator ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملSocial Network Visualization Oriented Multi-level Layout Method
We describe a fast multi-level layout for visualizing social networks, which can visualize social networks high quality and rapidly. There are two innovations in our fast multi-level layout. Firstly, we proposed a new graph multi-layered compression method based on random walk. The multi-layered compression process groups vertices to form “planet” systems and then abstract these “planet” system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003